Progress of Secure Computation: Basic Constructions and Dedicated Algorithms
نویسندگان
چکیده
منابع مشابه
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest majority that use the underlying primitive (e.g., enhanced trapdoor permutation) in a black-box way only. Until now, all known general constructions for this setting were inherently non-blackbox since they required the ...
متن کاملSecure Computation using Leaky Correlations (Asymptotically Optimal Constructions)
Most secure computation protocols can be e ortlessly adapted to o oad a signi cant fraction of their computationally and cryptographically expensive components to an o ine phase so that the parties can run a fast online phase and perform their intended computation securely. During this o ine phase, parties generate private shares of a sample generated from a particular joint distribution, refer...
متن کاملNew Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. Unfortunately it was shown that in the so called plain model, a large class of functionalities cannot be securely realized. These severe impossibility results motivated the study of other models involving some sort of s...
متن کاملBlack - Box Constructions for Secure Computation ∗ ( extended abstract )
It is well known that the secure computation of non-trivial functionalities in the setting of no honest majority requires computational assumptions. We study the way such computational assumptions are used. Specifically, we ask whether the secure protocol can use the underlying primitive (e.g., one-way trapdoor permutation) in a black-box way, or must it be nonblack-box (by referring to the cod...
متن کاملBasic Constructions and Examples
4. Examples. 7 4.1. Rigid rotation of a compact group. 7 4.2. Adding machines. 7 4.3. Interval Exchange Maps. 8 4.4. Full shifts and shifts of finite type. 9 4.5. More examples of subshifts. 10 4.5.1. Prouhet-Thue-Morse 11 4.5.2. Chacon system 11 4.5.3. Sturmian systems 11 4.5.4. Toeplitz systems 11 4.5.5. Sofic systems 11 4.5.6. Context-free systems 12 4.5.7. Coded systems 12 4.6. Smooth expan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE ESS Fundamentals Review
سال: 2018
ISSN: 1882-0875
DOI: 10.1587/essfr.12.1_12